Molecular Model Checking a Temporal Logic

نویسنده

  • Weijun Zhu
چکیده

Abstract. The molecular computing has been successfully employed to solve more and more complex computation problems. However, as an important complex problem, the model checking problem are still far from fully resolved under the circumstance of molecular computing, since it is still a lack of method. To address this issue, a model checking method is presented for checking the basic constructs in a given temporal logic using molecular computing. Through the design of the new encoding and calling this process, we can get a molecule-based approach for checking all of the basic constructs of this logic.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Checking EMTLK properties of timed interpreted systems via bounded model checking

We investigate a SAT-based bounded model checking (BMC) method for EMTLK (the existential fragment of the metric temporal logic with knowledge) that is interpreted over timed models generated by timed interpreted systems. In particular, we translate the existential model checking problem for EMTLK to the existential model checking problem for a linear temporal logic (called HLTLK), and we provi...

متن کامل

Temporal Logic Specification and Analysis for Model Transformations

In this paper we outline an approach for using temporal logic specifications and model-checking tools to express and verify model transformation properties. Linear Temporal Logic (LTL) is used to express transformation semantics, and the SMV formalism is used to encode this semantics and to perform model checking.

متن کامل

Model Checking Knowledge and Time

Model checking as an approach to the automatic veri cation of nite state systems has focussed predominantly on system speci cations expressed in temporal logic. In the distributed systems community, logics of knowledge (epistemic logics) have been advocated for expressing desirable properties of protocols and systems. A range of logics combining temporal and epistemic components have been devel...

متن کامل

Model Checking Knowledge and Time via Local Propositions: Cooperative and Adversarial Systems

Model checking as an approach to the automatic verification of finite state systems has focused predominantly on system specifications expressed in temporal logic. In the distributed systems community, logics of knowledge (epistemic logics) have been advocated for expressing desirable properties of protocols and systems. A range of logics combining temporal and epistemic components have been de...

متن کامل

Temporal Logic Query Checking through Multi-Valued Model Checking

Temporal logic query checking was first introduced by William Chan [3] to speed up design understanding by discovering properties not known a priori. A query is a temporal logic formula containing a special symbol ?1, known as a placeholder. Given a Kripke structure and a propositional formula ', we say that ' satisfies the query if replacing the placeholder by ' results in a temporal logic for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1608.01785  شماره 

صفحات  -

تاریخ انتشار 2016